K-D Decision Tree: An Accelerated and Memory Efficient Nearest Neighbor Classifier
نویسندگان
چکیده
منابع مشابه
K-D Decision Tree: An Accelerated and Memory Efficient Nearest Neighbor Classifier
This paper presents a novel Nearest Neighbor (NN) classifier. NN classification is a well studied method for pattern classification having the following properties; * it performs maximum-margin classification and achieves less than the twice of ideal Bayesian error, * it does not require the knowledge on pattern distributions, kernel functions or base classifiers, and * it can naturally be appl...
متن کاملEvidential Editing K-Nearest Neighbor Classifier
One of the difficulties that arises when using the K-nearest neighbor rule is that each of the labeled training samples is given equal importance in deciding the class of the query pattern to be classified, regardless of their typicality. In this paper, the theory of belief functions is introduced into the K-nearest neighbor rule to develop an evidential editing version of this algorithm. An ev...
متن کاملTreeCANN - k-d Tree Coherence Approximate Nearest Neighbor Algorithm
TreeCANN is a fast algorithm for approximately matching all patches between two images. It does so by following the established convention of finding an initial set of matching patch candidates between the two images and then propagating good matches to neighboring patches in the image plane. TreeCANN accelerates each of these components substantially leading to an algorithm that is ×3 to ×5 fa...
متن کاملOverlap pattern synthesis with an efficient nearest neighbor classifier
Nearest neighbor (NN) classifier is the most popular non-parametric classifier. It is a simple classifier with no design phase and shows good performance. Important factors affecting the efficiency and performance of NN classifier are (i) memory required to store the training set, (ii) classification time required to search the nearest neighbor of a given test pattern, and (iii) due to the curs...
متن کاملAutomatic Face Recognition System using P-tree and K-Nearest Neighbor Classifier
Face recognition has recently received remarkable attention in both authentication and identification systems due to high acceptability and collectability, regardless its lower circumvention and uniqueness than other biometric verification technologies. The basic approach with face recognition commences with feature set construction from the relevant facial traits of the users, termed enrollmen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2010
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e93.d.1670